<title>最大值最小化</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cm">/*</span>
<span class="pl-cm">2 2</span>
<span class="pl-cm">8 6</span>
<span class="pl-cm">*/</span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-mi">100005</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-p">{</span><span class="pl-mi">0</span><span class="pl-p">};</span>
<span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">s</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-n">m</span><span class="pl-p">,</span><span class="pl-n">k</span><span class="pl-p">;</span>
<span class="pl-kt">bool</span> <span class="pl-nf">check</span><span class="pl-p">(</span><span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">num</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">id</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span>     
    <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">tot</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>  
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;</span> <span class="pl-n">m</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-p">{</span>  
        <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">num</span> <span class="pl-o">-</span> <span class="pl-n">tot</span> <span class="pl-o">&gt;=</span> <span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">])</span> <span class="pl-p">{</span>    
            <span class="pl-n">tot</span> <span class="pl-o">+=</span> <span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>        
        <span class="pl-p">}</span>
        <span class="pl-k">else</span> <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span> <span class="pl-o">&gt;</span> <span class="pl-n">num</span><span class="pl-p">)</span>    
            <span class="pl-k">return</span> <span class="pl-nb">false</span><span class="pl-p">;</span>
        <span class="pl-k">else</span> <span class="pl-p">{</span>
            <span class="pl-n">id</span> <span class="pl-o">++</span><span class="pl-p">;</span>  
            <span class="pl-n">tot</span> <span class="pl-o">=</span> <span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span> 
            <span class="pl-k">if</span> <span class="pl-p">(</span><span class="pl-n">id</span> <span class="pl-o">&gt;</span> <span class="pl-n">k</span><span class="pl-p">)</span> <span class="pl-k">return</span> <span class="pl-nb">false</span><span class="pl-p">;</span> 
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-nb">true</span><span class="pl-p">;</span>    
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;maxmin.in&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;r&quot;</span><span class="pl-p">,</span><span class="pl-n">stdin</span><span class="pl-p">);</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;maxmin.out&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;w&quot;</span><span class="pl-p">,</span><span class="pl-n">stdout</span><span class="pl-p">);</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld%lld&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">k</span><span class="pl-p">);</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
                <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
                <span class="pl-n">s</span><span class="pl-o">+=</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>
        <span class="pl-p">}</span>
        <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">l</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-o">=</span><span class="pl-n">s</span><span class="pl-p">,</span><span class="pl-n">mid</span><span class="pl-p">;</span>
        <span class="pl-k">while</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">&lt;</span><span class="pl-n">r</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">){</span>
                <span class="pl-c1">//printf(&quot;%lld (%lld) %lld [%d]\n&quot;,l,mid,r,check(mid));</span>
                <span class="pl-n">mid</span><span class="pl-o">=</span><span class="pl-p">(</span><span class="pl-n">r</span><span class="pl-o">+</span><span class="pl-n">l</span><span class="pl-p">)</span><span class="pl-o">/</span><span class="pl-mi">2</span><span class="pl-p">;</span>
                <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">check</span><span class="pl-p">(</span><span class="pl-n">mid</span><span class="pl-p">))</span><span class="pl-n">r</span><span class="pl-o">=</span><span class="pl-n">mid</span><span class="pl-p">;</span>
                <span class="pl-k">else</span> <span class="pl-n">l</span><span class="pl-o">=</span><span class="pl-n">mid</span><span class="pl-p">;</span>
        <span class="pl-p">}</span>
        <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld&quot;</span><span class="pl-p">,</span><span class="pl-n">r</span><span class="pl-p">);</span>
        <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>